Scalable propagation-based call graph construction algorithms
نویسندگان
چکیده
منابع مشابه
An Assessment of Call Graph Construction Algorithms
LIMITED DISTRIBUTION NOTICE: This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and sp...
متن کاملScalable Corpus Annotation by Graph Construction and Label Propagation
The efficient annotation of documents in vast corpora calls for scalable methods of text classification. Representing the documents in the form of graph vertices, rather than in the form of vectors in a bag of words space, allows for the necessary information to be pre-computed and stored. It also fundamentally changes the problem definition, from a content-based to a relation-based classificat...
متن کاملAn Evaluation of Call Graph Construction Algorithms for Scala
As Scala gains popularity, there is growing interest in programming tools for it. Such tools often require call graphs. However, call graph construction algorithms in the literature do not handle Scala features, such as traits and abstract type members. Applying existing call graph construction algorithms to the JVM bytecodes generated by the Scala compiler produces very imprecise results due t...
متن کاملGraph Based Scalable Algorithms with Applications
OF THE DISSERTATION In this thesis, we propose various algorithms for problems arising in nonlinear circuits, nonlinear electromagnetics and data mining. Through the design and implementation of these algorithms, we show that the algorithms developed are scalable. In the first part of the thesis we provide two solutions to the forward problem of finding the steady-state solution of nonlinear RL...
متن کاملApplication-Only Call Graph Construction
Since call graphs are an essential starting point for all interprocedural analyses, many tools and frameworks have been developed to generate the call graph of a given program. The majority of these tools focus on generating the call graph of the whole program (i.e., both the application and the libraries that the application depends on). A popular compromise to the excessive cost of building a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 2000
ISSN: 0362-1340,1558-1160
DOI: 10.1145/354222.353190